Bounded Proper Forcing Axiom and Well Orderings of the Reals
نویسندگان
چکیده
We show that the bounded proper forcing axiom BPFA implies that there is a well-ordering of P(ω1) which is ∆1 definable with parameter a subset of ω1. Our proof shows that if BPFA holds then any inner model of the universe of sets that correctly computes א2 and also satisfies BPFA must contain all subsets of ω1. We show as applications how to build minimal models of BPFA and that BPFA implies that the decision problem for the Härtig quantifier is not lightface projective.
منابع مشابه
The Bounded Proper Forcing Axiom and Well Orderings of the Reals
We show that the bounded proper forcing axiom BPFA implies that there is a well-ordering of P(ω1) which is Δ1 definable with parameter a subset of ω1. Our proof shows that if BPFA holds then any inner model of the universe of sets that correctly computes א2 and also satisfies BPFA must contain all subsets of ω1. We show as applications how to build minimal models of BPFA and that BPFA implies t...
متن کاملProper forcing, cardinal arithmetic, and uncountable linear orders
In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ1-definable in (H(ω2),∈). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω1, ω∗ 1 , C, C ∗ where X is any suborder of the reals of size ...
متن کاملForcing axioms and projective sets of reals
This paper is an introduction to forcing axioms and large cardinals. Specifically, we shall discuss the large cardinal strength of forcing axioms in the presence of regularity properties for projective sets of reals. The new result shown in this paper says that ZFC + the bounded proper forcing axiom (BPFA) + “every projective set of reals is Lebesgue measurable” is equiconsistent with ZFC + “th...
متن کاملSubcomplete Forcing and L-Forcing
ABSRACT In his book Proper Forcing (1982) Shelah introduced three classes of forcings (complete, proper, and semi-proper) and proved a strong iteration theorem for each of them: The first two are closed under countable support iterations. The latter is closed under revised countable support iterations subject to certain standard restraints. These theorems have been heavily used in modern set th...
متن کاملThe Bounded Axiom A Forcing Axiom
We introduce the Bounded Axiom A Forcing Axiom(BAAFA). It turns out that it is equiconsistent with the existence of a regular Σ2-correct cardinal and hence also equiconsistent with BPFA. Furthermore we show that, if consistent, it does not imply the Bounded Proper Forcing Axiom(BPFA).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005